Directed distributed system: Backtracking problem
نویسندگان
چکیده
منابع مشابه
Constraint-Directed Backtracking
We propose a new backtracking algorithm called constraint-directed backtracking (CDBT) for solving general constraint-satisfaction problems (CSPs). CDBT and the naive backtracking (BT) share a similar style of instantiating and re-instantiating variables. They diier in that CDBT searches for an assignment to variables in a variable set from the given constraint posed on that variable set and ap...
متن کاملDistributed Dynamic Backtracking
In the scope of distributed constraint reasoning, the main algorithms presented so far have a feature in common: the addition of links between previously unrelated agents, before or during search. This paper presents a new search procedure for finding a solution in a distributed constraint satisfaction problem. This algorithm makes use of some of the good properties of centralised dynamic backt...
متن کاملBacktracking in Distributed Constraint Networks
The adaptation of software technology to distributed environments will be an important challenge in the next few years. In the scope of constraint reasoning, few works have been published on the adaptation of algorithms searching for a solution in a constraint network to distributed constraint networks. This paper presents a new search procedure for finding a solution in a distributed constrain...
متن کاملNon-Deterministic Lisp with Dependency-directed Backtracking
Extending functional Lisp with McCarthy’s nondeterministic operator AHFJ yields a language which can concisely express search problems. Dependencydirected backtracking is a powerful search strategy. We describe a non-deterministic Lisp dialect called SCHEMER and show that it can provide automatic dependency-directed backtracking. The resulting language provides a convenient interface to this ef...
متن کاملConcurrent Dynamic Backtracking for Distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search processes (SPs) that operate concurrently and scan non-intersecting parts of the global search space. Search processes are generated dynamically, started by the initializing agent, and by any number of agents during searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of the RAS
سال: 2018
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2018-30(2)-9